Adaptive energy efficient sensor scheduling for wireless sensor networks

نویسندگان

  • Yinying Yang
  • Mihaela Cardei
چکیده

In this paper, we consider an adaptive energy efficient sensor scheduling mechanism. We consider a wireless sensor network where the sink sends queries form time to time, and sensors are equipped with one or more sensing components. Our goal is to design an adaptive sensor scheduling mechanism to choose sets of active sensors to work alternatively such that different types of queries are served, the global connectivity requirements can be met, and network lifetime is maximized. A connected dominating set (CDS) based localized mechanism is proposed. Initially, a basic backbone is constructed, then when a query is issued, new sensors are activated locally such that to meet the requirements of the query and global connectivity. When a query expires, some sensors return to sleep and the CDS is restored. Our simulation results show that the solution is effective and it improved network lifetime.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A JOINT DUTY CYCLE SCHEDULING AND ENERGY AWARE ROUTING APPROACH BASED ON EVOLUTIONARY GAME FOR WIRELESS SENSOR NETWORKS

Network throughput and energy conservation are two conflicting important performance metrics for wireless sensor networks. Since these two objectives are in conflict with each other, it is difficult to achieve them simultaneously. In this paper, a joint duty cycle scheduling and energy aware routing approach is proposed based on evolutionary game theory which is called DREG. Making a trade-off ...

متن کامل

Mathematical Analysis of Optimal Tracking Interval Management for Power Efficient Target Tracking Wireless Sensor Networks

In this paper, we study the problem of power efficient tracking interval management for distributed target tracking wireless sensor networks (WSNs). We first analyze the performance of a distributed target tracking network with one moving object, using a quantitative mathematical analysis. We show that previously proposed algorithms are efficient only for constant average velocity objects howev...

متن کامل

An Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks

LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...

متن کامل

Improving Energy Consumption by Using Cluster Based Routing Algorithm in Wireless Sensor Networks

Multi-path is favorite alternative for sensor networks, as it provides an easy mechanism to distributetraffic, as well as considerate fault tolerance. In this paper, a new clustering based multi path routingprotocol namely ECRR (Energy efficient Cluster based Routing algorithm for improving Reliability) isproposed, which is a new routing algorithm and guarantees the achievement to required QoS ...

متن کامل

An Efficient Cluster Head Selection Algorithm for Wireless Sensor Networks Using Fuzzy Inference Systems

An efficient cluster head selection algorithm in wireless sensor networks is proposed in this paper. The implementation of the proposed algorithm can improve energy which allows the structured representation of a network topology. According to the residual energy, number of the neighbors, and the centrality of each node, the algorithm uses Fuzzy Inference Systems to select cluster head. The alg...

متن کامل

An Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks

This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Optimization Letters

دوره 4  شماره 

صفحات  -

تاریخ انتشار 2010